A Heuristic Approach for K-Coverage Extension with Energy-Efficient Sleep Scheduling in Sensor Networks

In this paper we consider the problem of coverage in a wireless sensor network where nodes already have been previously deployed. Our goal is to design an efficient strategy to add further nodes for achieving a certain target K-coverage throughout the entire monitoring region. A heuristic approach based on a dynamic model resembling gas bubbles is applied to solve this problem. Once the additional coverage has been reached, each node uses a self-organizing mechanism to determine its sleep schedule, depending on the activity of its surrounding nodes.